Incremental Rewriting Modulo SMT

Abstract Rewriting Modulo SMT combines two powerful automated deduction techniques (1) rewriting and (2) SMT-solving. enables the specification of behavior systems using rules, while theories specify system properties. is enabled by combining existing tools, such as Maude solvers. Search algorithms used for carrying out SMT, however, cannot exploit incremental solving features available in solvers they are based on breadth-first search. This paper addresses this limitation proposing Incremental Theories, which a syntactical restriction to rules. turns naturally be several applications including verification algorithms, cyber-physical systems, security protocols. Moreover, we propose Hybrid-Search algorithm Theories that search depth-first search, thus enabling We demonstrate through collection benchmarks can achieve 10 times performance improvement times.